136 research outputs found
Die Parteien entscheiden längst nicht mehr
Am 8. November wird in den USA nicht nur ein neuer Präsident, sondern auch ein neuer Kongress gewählt. Eine erneute Blockadehaltung könnte das Land zum Stillstand bringen und den sozialen Frieden gefährden
Drip and Mate Operations Acting in Test Tube Systems and Tissue-like P systems
The operations drip and mate considered in (mem)brane computing resemble the
operations cut and recombination well known from DNA computing. We here
consider sets of vesicles with multisets of objects on their outside membrane
interacting by drip and mate in two different setups: in test tube systems, the
vesicles may pass from one tube to another one provided they fulfill specific
constraints; in tissue-like P systems, the vesicles are immediately passed to
specified cells after having undergone a drip or mate operation. In both
variants, computational completeness can be obtained, yet with different
constraints for the drip and mate operations
Computing with cells: membrane systems - some complexity issues.
Membrane computing is a branch of natural computing which abstracts computing models from the structure and the functioning of the living cell. The main ingredients of membrane systems, called P systems, are (i) the membrane structure, which consists of a hierarchical arrangements of membranes which delimit compartments where (ii) multisets of symbols, called objects, evolve according to (iii) sets of rules which are localised and associated with compartments. By using the rules in a nondeterministic/deterministic maximally parallel manner, transitions between the system configurations can be obtained. A sequence of transitions is a computation of how the system is evolving. Various ways of controlling the transfer of objects from one membrane to another and applying the rules, as well as possibilities to dissolve, divide or create membranes have been studied. Membrane systems have a great potential for implementing massively concurrent systems in an efficient way that would allow us to solve currently intractable problems once future biotechnology gives way to a practical bio-realization. In this paper we survey some interesting and fundamental complexity issues such as universality vs. nonuniversality, determinism vs. nondeterminism, membrane and alphabet size hierarchies, characterizations of context-sensitive languages and other language classes and various notions of parallelism
Accepting splicing systems with permitting and forbidding words
Abstract: In this paper we propose a generalization of the accepting splicingsystems introduced in Mitrana et al. (Theor Comput Sci 411:2414?2422,2010). More precisely, the input word is accepted as soon as a permittingword is obtained provided that no forbidding word has been obtained sofar, otherwise it is rejected. Note that in the new variant of acceptingsplicing system the input word is rejected if either no permitting word isever generated (like in Mitrana et al. in Theor Comput Sci 411:2414?2422,2010) or a forbidding word has been generated and no permitting wordhad been generated before. We investigate the computational power ofthe new variants of accepting splicing systems and the interrelationshipsamong them. We show that the new condition strictly increases thecomputational power of accepting splicing systems. Although there areregular languages that cannot be accepted by any of the splicing systemsconsidered here, the new variants can accept non-regular and even non-context-free languages, a situation that is not very common in the case of(extended) finite splicing systems without additional restrictions. We alsoshow that the smallest class of languages out of the four classes definedby accepting splicing systems is strictly included in the class of context-free languages. Solutions to a few decidability problems are immediatelyderived from the proof of this result
Control Words of String Rewriting P Systems
P systems with controlled computations have been introduced and investigated in the recent past, by assigning labels to the rules in the regions of the P system and guiding the computations by control words. Here we consider string rewriting cell-like transition P system with label assigned rules working in acceptor mode and compare the obtained family of languages of control words over the rule labels with certain well-known language families. An application to chain code picture generation is also pointed out
Probabilistic Guarded P Systems, A New Formal Modelling Framework
Multienvironment P systems constitute a general, formal
framework for modelling the dynamics of population biology, which consists
of two main approaches: stochastic and probabilistic. The framework
has been successfully used to model biologic systems at both micro (e.g.
bacteria colony) and macro (e.g. real ecosystems) levels, respectively.
In this paper, we extend the general framework in order to include
a new case study related to P. Oleracea species. The extension is made
by a new variant within the probabilistic approach, called Probabilistic
Guarded P systems (in short, PGP systems). We provide a formal definition,
a simulation algorithm to capture the dynamics, and a survey of
the associated software.Ministerio de Economía y Competitividad TIN2012- 37434Junta de Andalucía P08-TIC-0420
Simulating Turing Machines with Polarizationless P Systems with Active Membranes
We prove that every single-tape deterministic Turing machine working in
t(n)
t(n)
time, for some function
t:N→N
t:N→N
, can be simulated by a uniform family of polarizationless P systems with active membranes. Moreover, this is done without significant slowdown in the working time. Furthermore, if
logt(n)
logt(n)
is space constructible, then the members of the uniform family can be constructed by a family machine that uses
O(logt(n))
O(logt(n))
space.Ministerio de Economía y Competitividad TIN2012-3743
A new class of symbolic abstract neural nets
Starting from the way the inter-cellular communication takes place by means of protein channels and also from the standard knowledge about neuron functioning, we propose a computing model called a tissue P system, which processes symbols in a multiset rewriting sense, in a net of cells similar to a neural net. Each cell has a finite state memory, processes multisets of symbol-impulses, and can send impulses (?excitations?) to the neighboring cells. Such cell nets are shown to be rather powerful: they can simulate a Turing machine even when using a small number of cells, each of them having a small number of states. Moreover, in the case when each cell works in the maximal manner and it can excite all the cells to which it can send impulses, then one can easily solve the Hamiltonian Path Problem in linear time. A new characterization of the Parikh images of ET0L languages are also obtained in this framework
THE INFLUENCE OF HAMMERS` PERIPHERAL SPEED ON THE PERFORMANCE OF THE HAMMER MILLS
Cereal milling is a complex process resulting in a wide variety of particles that differ in size, surface or composition. Ensuring a rational regime regarding the technological process of hammer mills operation, actually refers to the correlation of the indices to ensure the functioning of the mills at optimal values. The peripheral speed of hammers is one of the decisive factors in the milling process. Speed limitation is determined by fodder resistance, the construction of working parts and their durability. In the paper we study the influence of hammers` peripheral speed on the product subjected to milling, through a series of experiments under exploitation conditions
- …